A lower bound on the 2-adic complexity of modified Jacobi sequence

Lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^n$

Let p be an odd prime, n a positive integer and g a primitive root of pn. Suppose D (p) i = {g 2s + i|s = 0, 1, 2, · · · , (p−1)p n−1 2 }, i = 0, 1 is the generalized cyclotomic classes with Z∗ pn = D0 ∪D1. In this paper, we prove that Gauss periods based on D0 and D1 are both equal to 0 for n ≥ 2. As an application, we determine a lower bound on the 2-adic complexity of generalized cyclotomic ...

A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods

  In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...

Lower bounds of Copson type for the transpose of matrices on weighted sequence spaces

Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-ary m-Sequence

In modern stream cipher, there are many algorithms, such as ZUC, LTE encryption algorithm and LTE integrity algorithm, using bit-component sequences of p-ary m-sequences as the input of the algorithm. Therefore, analyzing their statistical property (For example, autocorrelation, linear complexity and 2-adic complexity) of bit-component sequences of p-ary m-sequences is becoming an important res...

2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting k Symbols within One Period

In this paper, we propose a method to get the lower bounds of the 2-adic complexity of a sequence obtained from a periodic sequence over by either inserting or deleting symbols within one period. The results show the variation of the distribution of the 2-adic complexity becomes as increases. Particularly, we discuss the lower bounds when respectively. k (2) GF